例句與造句

1. Underspecification relies on the  Maximal Subset Condition . 
2. Note that the Maximal Subset Condition stated above is a formal instantiation of the elsewhere condition.
3. Equivalently, it is the cardinality of a maximal subset of " G " that generates a free subgroup.
4. Finally, just as in allomorphy, the Maximal Subset Principle will play a part if the contextual specification for one alloseme is a subset of another alloseme.
5. This is known as the Maximal Subset Condition or the Elsewhere Principle : if two items have a similar set of features, the one that is more specific will win.
6. It's difficult to find maximal subset in a sentence. 用maximal subset造句挺難的
7. John ate up the story vs . John ate up all his food ), are not necessarily the exact specifications, they illustrate a hypothetical use of the Maximal Subset Condition:
8. Bottom-up subset exploration ( essentially a breadth-first traversal of the subset lattice ) finds any maximal subset S only after all 2 ^ { | S | }-1 of its proper subsets.
9. The Maximal Subset Condition states firstly that, for a given exponent E to be inserted into some feature bundle T, the featural specification on E must be a subset of the features on T . In this way, /-s / is not a possible exponent for a feature bundle [ 2sg, present ].
10. The maximal subset of " S " ? that is closed under ( finite series of ) arithmetic operations is the field of real numbers, obtained by leaving out the infinities 鄙, the infinitesimals 鋇, and the infinitesimal neighbors " y " 鋇 of each nonzero dyadic fraction " y ".
11. To ensure that /-s / is chosen over / ?/ for the bundle [ 3sg, present ], the Maximal Subset Condition states secondly that, between two exponents E and F which both contain a subset of the features in a feature bundle T, the exponent that contains the maximal subset of the features in T will be selected.
12. To ensure that /-s / is chosen over / ?/ for the bundle [ 3sg, present ], the Maximal Subset Condition states secondly that, between two exponents E and F which both contain a subset of the features in a feature bundle T, the exponent that contains the maximal subset of the features in T will be selected.
13. ;WIDTIO : ( When in Doubt, Throw it Out ) the maximal subsets of K that are consistent with P are intersected, and P is added to the resulting set; in other words, the result of revision is composed by P and of all formulae of K that are in all maximal subsets of K that are consistent with P;
14. ;WIDTIO : ( When in Doubt, Throw it Out ) the maximal subsets of K that are consistent with P are intersected, and P is added to the resulting set; in other words, the result of revision is composed by P and of all formulae of K that are in all maximal subsets of K that are consistent with P;
15. A shorter but more abstract proof goes as follows : by Zorn's lemma, select " U " to be a maximal subset of " H " with the following three properties : all elements of " U " are eigenvectors of " T ", they have norm one, and any two distinct elements of " U " are orthogonal.